/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 苏李涛
 * Date: 2024-09-27
 * Time: 23:53
 */
public class Stairs {
    /**
     动态规划题：方法一：

     1.创建dp表
     2.初始化
     3.填表
     4.返回
     */
    public int minCostClimbingStairs(int[] cost) {
        int n = cost.length;
        int[] dp = new int[n+1];
        for(int i = 2; i <= n; i++){
            dp[i] = Math.min(dp[i-1] + cost[i-1],dp[i-2] + cost[i-2]);
        }

        return dp[n];
    }

}
